Investigation of the global dynamics of cellular automata using Boolean derivatives

نویسندگان

  • Pabitra Pal Choudhury
  • Sudhakar Sahoo
  • Mithun Chakraborty
  • Subir Kumar Bhandari
  • Amita Pal
چکیده

Global dynamics of a non-linear Cellular Automaton (CA), is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In this paper, efforts have beenmade to systematize non-linear CA evolutions in the light of Boolean derivatives and Jacobianmatrices. A few new theorems onHamming Distance between Boolean functions as well as on Jacobian matrices of cellular automata are proposed and proved. Moreover, a classification of Boolean functions based on the nature of deviation from linearity has been suggested with a view to grouping them together to classes/subclasses such that the members of a class/subclass satisfy certain similar properties. Next, an error vector, which cannot be captured by the Jacobian matrix, is identified and systematically classified. This leads us to the concept of modified Jacobian matrix whereby a quasi-affine representation of a non-linear cellular automaton is introduced. © 2009 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Characterization Of any Non-linear Boolean function Using A Set of Linear Operators

Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize non-linear CA evolutions in the light of Boolean derivatives and Jacobian Matrices. In this paper two different efforts have been made: first we try to systematize n...

متن کامل

Design of low power random number generators for quantum-dot cellular automata

Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA.  Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...

متن کامل

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2009